package com.jiang.daily.Q3190;

/**
 * @author Jiang
 * @version 1.0
 * @date 2025/11/22 14:58
 */
class Solution {
    public int minimumOperations(int[] nums) {
        int res = 0;
        for (int n: nums) {
            if (n % 3 != 0) res++;
        }
        return res;
    }
}
